翻訳と辞書 Words near each other ・ Hadamar ・ Hadamar Euthanasia Centre ・ Hadamar III of Laber ・ Hadamard (disambiguation) ・ Hadamard code ・ Hadamard manifold ・ Hadamard matrix ・ Hadamard product ・ Hadamard product (matrices) ・ Hadamard regularization ・ Hadamard space ・ Hadamard three-circle theorem ・ Hadamard three-lines theorem ・ Hadamard transform ・ Hadamard's dynamical system ・ Hadamard's inequality ・ Hadamard's lemma ・ Hadamard's maximal determinant problem ・ Hadamard's method of descent ・ Hadamard–Rybczynski equation ・ Hadamczik ・ Hadameh ・ Hadameh-ye Olya ・ Hadameh-ye Vosta ・ Hadan ・ Hadan Holligan ・ Hadan Station ・ Hadan Station (Busan) ・ Hadancourt-le-Haut-Clocher ・ Hadang Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Hadamard's inequality ： ウィキペディア英語版 Hadamard's inequality In mathematics, Hadamard's inequality, first published by Jacques Hadamard in 1893,〔Maz'ya & Shaposhnikova〕 is a bound on the determinant of a matrix whose entries are complex numbers in terms of the lengths of its column vectors. In geometrical terms, when restricted to real numbers, it bounds the volume in Euclidean space of ''n'' dimensions marked out by ''n'' vectors ''vi'' for 1 ≤ ''i'' ≤ ''n'' in terms of the lengths of these vectors ||''vi''||. Specifically, Hadamard's inequality states that if ''N'' is the matrix having columns〔The result is sometimes stated in terms of row vectors. That this is equivalent is seen by applying the transpose.〕 ''vi'', then :$|\backslash det(N)|\backslash le\; \backslash prod\_^n\; \backslash |v\_i\backslash |,$ and equality is achieved if and only if the vectors are orthogonal or at least one of the columns is 0. ==Alternate forms and corollaries== A corollary is that if the entries of an ''n'' by ''n'' matrix ''N'' are bounded by B, so |''Nij''|≤''B'' for all ''i'' and ''j'', then :$|\backslash det(N)|\backslash le\; B^nn^.$ In particular, if the entries of N are +1 and −1 only then〔Garling〕 :$|\backslash det(N)|\backslash le\; n^.$ In combinatorics, matrices ''N'' for which equality holds, i.e. those with orthogonal columns, are called Hadamard matrices. A positive-semidefinite matrix ''P'' can be written as ''N'' *''N'', where ''N'' * denotes the conjugate transpose of ''N'' (see Cholesky decomposition). Then :$\backslash det(P)=\backslash det(N)^2\; \backslash le\; \backslash prod\_^n\; \backslash |v\_i\backslash |^2\; =\; \backslash prod\_^n\; p\_.$ So, the determinant of a positive definite matrix is less than or equal to the product of its diagonal entries. Sometimes this is also known as Hadamard's inequality.〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hadamard's inequality」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.